The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
نویسندگان
چکیده
We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a goal. In many motion planning applications ranging from maneuvering vehicles over unfamiliar terrain to steering flexible medical needles through human tissue, the response of a robot to commanded actions cannot be precisely predicted. We propose to build a roadmap by sampling collision-free states in the configuration space and then locally sampling motions at each state to estimate state transition probabilities for each possible action. Given a query specifying initial and goal configurations, we use the roadmap to formulate a Markov Decision Process (MDP), which we solve using Infinite Horizon Dynamic Programming in polynomial time to compute stochastically optimal plans. The Stochastic Motion Roadmap (SMRM) thus combines a samplingbased roadmap representation of the configuration space, as in PRM’s, with the well-established theory of MDP’s. Generating both states and transition probabilities by sampling is far more flexible than previous Markov motion planning approaches based on problem-specific or grid-based discretizations. In this paper, we formulate SMRM and demonstrate it by generating nonholonomic plans for steerable needles, a new class of medical needles that follow curved paths through soft tissue and can be modeled as a variant of a Dubins car. Using randomized simulations, we show that SMRM is computationally faster than a previously reported MDP method and confirm that SMRM generates motion plans with a significantly higher probability of success compared to shortest-path plans.
منابع مشابه
FIRM : Sampling - based feedback motion planning under motion uncertainty and imperfect
In this paper we present feedback-based information roadmap (FIRM), a multi-query approach for planning under uncertainty which is a belief-space variant of probabilistic roadmap methods. The crucial feature of FIRM is that the costs associated with the edges are independent of each other, and in this sense it is the first method that generates a graph in belief space that preserves the optimal...
متن کاملIntegrated Inspection Planning and Preventive Maintenance for a Markov Deteriorating System Under Scenario-based Demand Uncertainty
In this paper, a single-product, single-machine system under Markovian deterioration of machine condition and demand uncertainty is studied. The objective is to find the optimal intervals for inspection and preventive maintenance activities in a condition-based maintenance planning with discrete monitoring framework. At first, a stochastic dynamic programming model whose state variable is the ...
متن کاملBounded Uncertainty Roadmaps for Path Planning
Motion planning under uncertainty is an important problem in robotics. Although probabilistic sampling is highly successful for motion planning of robots with many degrees of freedom, sampling-based algorithms typically ignore uncertainty during planning. We introduce the notion of a bounded uncertainty roadmap (BURM) and use it to extend samplingbased algorithms for planning under uncertainty ...
متن کاملStochastic Conformational Roadmaps for Computing Ensemble Properties of Molecular Motion
A key intuition behind probabilistic roadmap planners for motion planning is that many collision-free paths potentially exist between two given robot configurations. Hence the connectivity of a robot’s free space can be captured effectively by a network of randomly sampled configurations. In this paper, a similar intuition is exploited to preprocess molecular motion pathways and efficiently com...
متن کاملSampling-Based Motion Planning Using Uncertain Knowledge
Sampling-based algorithms have dramatically improved the state of the art in robotic motion planning. However, these approaches still make significant assumptions that limit their applicability for real-world planning. This work describes how one of these assumptions: that the world is perfectly known, can be removed. We propose a predictive roadmap planner that incorporates uncertainty directl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007